Automata and Coinduction (an Exercise in Coalgebra) Automata and Coinduction (an Exercise in Coalgebra)
نویسنده
چکیده
The classical theory of deterministic automata is presented in terms of the notions of homomor-phism and bisimulation, which are the cornerstones of the theory of (universal) coalgebra. This leads to a transparent and uniform presentation of automata theory and yields some new insights, amongst which coinduction proof methods for language equality and language inclusion. At the same time, the present treatment of automata theory may serve as an introduction to coalgebra.
منابع مشابه
Automata and Coinduction
The classical theory of deterministic automata is presented in terms of the notions of homomorphism and bisimulation, which are the cornerstones of the theory of (universal) coalgebra. This leads to a transparent and uniform presentation of automata theory and yields some new insights, amongst which coinduction proof methods for language equality and language inclusion. At the same time, the pr...
متن کاملControl of Discrete-Event Systems with Partial Observations Using Coalgebra and Coinduction
Control of discrete-event systems with partial observations is treated by concepts and results of coalgebra and coinduction. Coalgebra is part of abstract algebra and enables a generalization of the computer science concept of bisimulation. It can be applied to automata theory and then provides a powerful algebraic tool to treat problems of supervisory control. A framework for control of discre...
متن کاملCoalgebraic Semantics of Heavy-Weighted Automata
In this paper we study heavy-weighted automata, a generalization of weighted automata in which the weights of the transitions can be formal power series. As for ordinary weighted automata, the behaviour of heavy-weighted automata is expressed in terms of formal power series. We propose several equivalent definitions for their semantics, including a system of behavioural differential equations (...
متن کاملElements of Stream Calculus (An Extensive Exercise in Coinduction)
Elements of stream calculus (an extensive exercise in coinduction) CWI's research has a theme-oriented structure and is grouped into four clusters. Listed below are the names of the clusters and in parentheses their acronyms. ABSTRACT Based on the presence of a nal coalgebra structure on the set of streams innnite sequences of real numbers, a coinductive calculus of streams is developed. The ma...
متن کاملUsing coalgebra and coinduction to define ontology-based multi-agent systems
In the past, algebra has been predominantly used to define computer systems. However, computer systems are becoming more dynamic nowadays and algebra is not suitable anymore to define such systems. For this reason, coalgebra and coinduction have been introduced into the computer and information society. Coalgebra and coinduction present a powerful mechanism for representing many different kinds...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998